The Girard Translation Extended with Recursion

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Girard Translation Extended with Recursion

This paper extends Curry-Howard interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the λ-calculus and the linear λ-calculus respectively, are given sound categorical interpretations. The embedding of proofs of IL into proofs of ILL given by the Girard Translation is extended with the rules for recursion, suc...

متن کامل

Translation using Minimal Recursion

We describe minimal recursion semantics (MRS), a framework for semantics within HPSG, which considerably simpliies transfer and generation. We discuss why, in general, a semantic representation with minimal structure is desirable for transfer and illustrate how a descriptively adequate representation with a non-recursive structure may be achieved. The paper illustrates the application of MRS to...

متن کامل

Translation using Minimal Recursion Semantics

We describe minimal recursion semantics (MRS), a framework for semantics within HPSG, which considerably simplifies transfer and generation. We discuss why, in general, a semantic representation with minimal structure is desirable for transfer and illustrate how a descriptively adequate representation with a non-recursive structure may be achieved. The paper illustrates the application of MRS t...

متن کامل

Rank - 2 Intersection and Polymorphic Recursion ( extended version with proofs )

Let ⊢ be a rank-2 intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the context) if system ⊢ can prove that it has a simple type. In this paper we propose new typing rules and algorithms that are able to type recursive definitions that are not simple. At the best of our knowledge, previous algorithms for typing recursive definitions in the ...

متن کامل

The Girard-Reynolds Isomorphism

ion Theorem x1 : A1, . . . , xn : An ` t : B in F2 ⇒ (x1, x1) ∈ A ∗‡ 1 , . . . , (xn, x ′ n) ∈ A∗‡ n ` (|t|, |t|′) ∈ B∗‡ in P2

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BRICS Report Series

سال: 1995

ISSN: 1601-5355,0909-0878

DOI: 10.7146/brics.v2i13.19882